Nerve Complexes of Circular Arcs
نویسندگان
چکیده
منابع مشابه
Nerve Complexes of Circular Arcs
We show that the nerve complex of n arcs in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time O(n log n). For the particular case of the nerve complex of evenly-spaced arcs of the same length, we determine the dihedral group action on homology, and we relate th...
متن کاملTriangulations with Circular Arcs
An important objective in the choice of a triangulation is that the smallest angle becomes as large as possible. In the straight line case, it is known that the Delaunay triangulation is optimal in this respect. We propose and study the concept of a circular arc triangulation— a simple and effective alternative that offers flexibility for additionally enlarging small angles—and discuss its appl...
متن کاملContact Graphs of Circular Arcs
We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interiordisjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)-sparse if every s-vertex subgraph has at most 2s− k edges, and (2, k)-tight if in addition it has exactly 2n− k edges, where n is ...
متن کاملPerceptual grouping of circular arcs under projection
The world (both natural and man-made) is constrained by physical laws to a finite number of basic patterns. Certain three dimensional relationships between features in a scene give rise to two dimensional relationships that are relatively viewpoint invariant and can be distinguished as non-accidental. Thus, those regularities observable in the image arise not by accident, but are projections of...
متن کاملDetection of Circular Arcs in Images
A long standing problem in computer vision is the extraction of meaningful features from images. This paper describes a method of detecting circular arcs in images based on a recursive algorithm that first analyses lists of connected edge points and finds a polygonal description, and then analyses this description fitting arcs to groups of connected lines. The result is a description of image e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2016
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-016-9803-5